452 research outputs found

    MORE: Merged Opinions Reputation Model

    Get PDF
    Reputation is generally defined as the opinion of a group on an aspect of a thing. This paper presents a reputation model that follows a probabilistic modelling of opinions based on three main concepts: (1) the value of an opinion decays with time, (2) the reputation of the opinion source impacts the reliability of the opinion, and (3) the certainty of the opinion impacts its weight with respect to other opinions. Furthermore, the model is flexible with its opinion sources: it may use explicit opinions or implicit opinions that can be extracted from agent behavior in domains where explicit opinions are sparse. We illustrate the latter with an approach to extract opinions from behavioral information in the sports domain, focusing on football in particular. One of the uses of a reputation model is predicting behavior. We take up the challenge of predicting the behavior of football teams in football matches, which we argue is a very interesting yet difficult approach for evaluating the model.Comment: 12th European Conference on Multi-Agent Systems (EUMAS 2014

    TAIP: an anytime algorithm for allocating student teams to internship programs

    Full text link
    In scenarios that require teamwork, we usually have at hand a variety of specific tasks, for which we need to form a team in order to carry out each one. Here we target the problem of matching teams with tasks within the context of education, and specifically in the context of forming teams of students and allocating them to internship programs. First we provide a formalization of the Team Allocation for Internship Programs Problem, and show the computational hardness of solving it optimally. Thereafter, we propose TAIP, a heuristic algorithm that generates an initial team allocation which later on attempts to improve in an iterative process. Moreover, we conduct a systematic evaluation to show that TAIP reaches optimality, and outperforms CPLEX in terms of time.Comment: 10 pages, 7 figure

    DipGame: A challenging negotiation testbed

    Get PDF
    There is a chronic lack of shared application domains to test advanced research models and agent negotiation architectures in Multiagent Systems. In this paper we introduce a friendly testbed for that purpose. The testbed is based on The Diplomacy Game where negotiation and the relationships between players play an essential role. The testbed profits from the existence of a large community of human players that know the game and can easily provide data for experiments. We explain the infrastructure in the paper and make it freely available to the AI community. © 2011 Elsevier Ltd. All rights reserved.Research supported by the Agreement Technologies CONSOLIDER project under contract CSD2007-0022 and INGENIO 2010, by the Agreement Technologies COST Action, IC0801, and by the Generalitat de Catalunya under the grant 2009-SGR-1434.Peer Reviewe

    A Roadmap for Self-Evolving Communities

    Get PDF
    Self-organisation and self-evolution is evident in physics, chemistry, biology, and human societies. Despite the existing literature on the topic, we believe self-organisation and self-evolution is still missing from the IT tools (whether online or offline) we are building and using. In the last decade, human interactions have been moving more and more towards social media. The time we spend interacting with others in virtual communities and networks is tremendous. Yet, the tools supporting those interactions remain rigid. This position paper argues the need for self-evolving software-enabled communities, and proposes a roadmap for achieving this required self-evolution. The proposal is based on building normative-based communities, where community interactions are regulated by norms and community members are free to discuss and modify their community's norms. The evolution of communities is then dictated by the evolution of its norms.Peer Reviewe

    Dispute Resolution Using Argumentation-Based Mediation

    Get PDF
    Mediation is a process, in which both parties agree to resolve their dispute by negotiating over alternative solutions presented by a mediator. In order to construct such solutions, mediation brings more information and knowledge, and, if possible, resources to the negotiation table. The contribution of this paper is the automated mediation machinery which does that. It presents an argumentation-based mediation approach that extends the logic-based approach to argumentation-based negotiation involving BDI agents. The paper describes the mediation algorithm. For comparison it illustrates the method with a case study used in an earlier work. It demonstrates how the computational mediator can deal with realistic situations in which the negotiating agents would otherwise fail due to lack of knowledge and/or resources.Comment: 6 page

    Synergistic Team Composition

    Full text link
    Effective teams are crucial for organisations, especially in environments that require teams to be constantly created and dismantled, such as software development, scientific experiments, crowd-sourcing, or the classroom. Key factors influencing team performance are competences and personality of team members. Hence, we present a computational model to compose proficient and congenial teams based on individuals' personalities and their competences to perform tasks of different nature. With this purpose, we extend Wilde's post-Jungian method for team composition, which solely employs individuals' personalities. The aim of this study is to create a model to partition agents into teams that are balanced in competences, personality and gender. Finally, we present some preliminary empirical results that we obtained when analysing student performance. Results show the benefits of a more informed team composition that exploits individuals' competences besides information about their personalities

    Weaving a fabric of socially aware agents

    Get PDF
    The expansion of web-enabled social interaction has shed light on social aspects of intelligence that have not been typically studied within the AI paradigm so far. In this context, our aim is to understand what constitutes intelligent social behaviour and to build computational systems that support it. We argue that social intelligence involves socially aware, autonomous individuals that agree on how to accomplish a common endeavour, and then enact such agreements. In particular, we provide a framework with the essential elements for such agreements to be achieved and executed by individuals that meet in an open environment. Such framework sets the foundations to build a computational infrastructure that enables socially aware autonomy.This work has been supported by the projects EVE(TIN2009-14702-C02-01) and AT (CSD2007-0022)Peer Reviewe

    Charters for Self-Evolving Communities

    Get PDF
    Self-organisation and self-evolution is evident in physics, chem-istry, biology, and human societies. Despite the existing literature on the topic, we believe self-organisation and self-evolution is still missing in the IT tools we are building and using. Instead of creating numerous rigid systems, we should aim at providing tools for creating self-evolving systems that adapt to the ever evolving community's needs. This pa- per proposes a roadmap for self-evolution by presenting a set of building blocks, which we refer to as community charters. The paper also presents an approach for each of these blocks, helping build the first prototype for self-evolving communities.This work is supported by the PRAISE project (funded by the European Commission under the FP7 STREP grant number 318770), the CBIT project (funded by the Spanish Ministry of Science & Innovation under the grant number TIN2010-16306), and the Agreement Technologies project (funded by CONSOLIDER CSD 2007-0022, INGENIO 2010).Peer Reviewe
    corecore